Substitution in non-wellfounded syntax with variable binding
نویسندگان
چکیده
منابع مشابه
Substitution in non-wellfounded syntax with variable binding
Inspired from the recent developments in theories of non-wellfounded syntax (coinductively defined languages) and of syntax with binding operators, the structure of algebras of wellfounded and non-wellfounded terms is studied for a very general notion of signature permitting both simple variable binding operators as well as operators of explicit substitution. This is done in an extensional math...
متن کاملSyntax and Variable Binding
Syntax and Variable Binding (Extended Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi∗ LFCS Univ. of Edinburgh
متن کاملAbstract Syntax and Variable Binding
Syntax and Variable Binding (Extended Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh
متن کاملNon-Wellfounded Mereology
This paper is a systematic exploration of non-wellfounded mereology. Motivations and applications suggested in the literature are considered. Some are exotic like Borges’ Aleph, and the Trinity; other examples are less so, like time traveling bricks, and even Geach’s Tibbles the Cat. The authors point out that the transitivity of non-wellfounded parthood is inconsistent with extensionality. A n...
متن کاملA New Approach to Abstract Syntax with Variable Binding 1
The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of formal systems involving variable-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together with Cartesian prod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.07.025